TSTP Solution File: PUZ143^1 by Refute---2015

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : PUZ143^1 : TPTP v6.4.0. Released v6.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n014.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 16091.75MB
% OS       : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Thu Apr 14 02:30:26 EDT 2016

% Result   : Timeout 300.06s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ143^1 : TPTP v6.4.0. Released v6.2.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n014.star.cs.uiowa.edu
% 0.03/0.23  % Model    : x86_64 x86_64
% 0.03/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23  % Memory   : 16091.75MB
% 0.03/0.23  % OS       : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.23  % CPULimit : 300
% 0.03/0.23  % DateTime : Wed Apr  6 10:08:39 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.27/5.85  > val it = (): unit
% 6.47/6.09  Trying to find a model that refutes: bnd_playerpos M ~= bnd_c31
% 7.18/6.79  Unfolded term: [| bnd_c34 = bnd_next bnd_c33 bnd_top; bnd_c33 = bnd_next bnd_c32 bnd_top;
% 7.18/6.79     bnd_c32 = bnd_next bnd_c31 bnd_top; bnd_c31 = bnd_next bnd_c30 bnd_top;
% 7.18/6.79     bnd_c24 = bnd_next bnd_c23 bnd_top; bnd_c23 = bnd_next bnd_c22 bnd_top;
% 7.18/6.79     bnd_c22 = bnd_next bnd_c21 bnd_top; bnd_c21 = bnd_next bnd_c20 bnd_top;
% 7.18/6.79     bnd_c14 = bnd_next bnd_c13 bnd_top; bnd_c13 = bnd_next bnd_c12 bnd_top;
% 7.18/6.79     bnd_c12 = bnd_next bnd_c11 bnd_top; bnd_c11 = bnd_next bnd_c10 bnd_top;
% 7.18/6.79     bnd_c04 = bnd_next bnd_c03 bnd_top; bnd_c03 = bnd_next bnd_c02 bnd_top;
% 7.18/6.79     bnd_c02 = bnd_next bnd_c01 bnd_top; bnd_c01 = bnd_next bnd_c00 bnd_top;
% 7.18/6.79     bnd_c40 = bnd_next bnd_c30 bnd_right;
% 7.18/6.79     bnd_c30 = bnd_next bnd_c20 bnd_right;
% 7.18/6.79     bnd_c20 = bnd_next bnd_c10 bnd_right;
% 7.18/6.79     bnd_c10 = bnd_next bnd_c00 bnd_right; bnd_playerpos bnd_nomove = bnd_c11;
% 7.18/6.79     bnd_wall bnd_c32 = False; bnd_wall bnd_c22 = True;
% 7.18/6.79     bnd_wall bnd_c12 = True; bnd_wall bnd_c02 = True;
% 7.18/6.79     bnd_wall bnd_c31 = False; bnd_wall bnd_c21 = True;
% 7.18/6.79     bnd_wall bnd_c11 = False; bnd_wall bnd_c01 = True;
% 7.18/6.79     bnd_wall bnd_c30 = False; bnd_wall bnd_c20 = True;
% 7.18/6.79     bnd_wall bnd_c10 = True; bnd_wall bnd_c00 = True;
% 7.18/6.79     ALL PO M D.
% 7.18/6.79        bnd_playerpos M = PO -->
% 7.18/6.79        bnd_wall (bnd_next PO D) --> bnd_playerpos (bnd_movedir M D) = PO;
% 7.18/6.79     ALL PO M D.
% 7.18/6.79        bnd_playerpos M = PO -->
% 7.18/6.79        ~ bnd_wall (bnd_next PO D) -->
% 7.18/6.79        bnd_playerpos (bnd_movedir M D) = bnd_next PO D;
% 7.18/6.79     ALL P. bnd_next (bnd_next P bnd_top) bnd_bottom = P;
% 7.18/6.79     ALL P. bnd_next (bnd_next P bnd_left) bnd_right = P;
% 7.18/6.79     ALL D1 D2 P. bnd_next (bnd_next P D1) D2 = bnd_next (bnd_next P D2) D1 |]
% 7.18/6.79  ==> ~ bnd_playerpos M = bnd_c31
% 7.18/6.79  Adding axioms...
% 7.28/6.80  Typedef.type_definition_def
% 7.48/7.03  Typedef.type_definition_def
% 9.29/8.82  Typedef.type_definition_def
% 10.67/10.27   ...done.
% 10.67/10.27  Ground types: ?'b, bnd_position, bnd_direction, bnd_movelist
% 10.67/10.27  Translating term (sizes: 1, 1, 1, 1) ...
% 13.09/12.62  Invoking SAT solver...
% 13.18/12.93  No model exists.
% 13.18/12.93  Translating term (sizes: 2, 1, 1, 1) ...
% 17.69/17.21  Invoking SAT solver...
% 17.69/17.21  No model exists.
% 17.69/17.21  Translating term (sizes: 1, 2, 1, 1) ...
% 20.41/20.00  Invoking SAT solver...
% 20.41/20.00  No model exists.
% 20.41/20.00  Translating term (sizes: 1, 1, 2, 1) ...
% 23.30/22.82  Invoking SAT solver...
% 23.30/22.82  No model exists.
% 23.30/22.82  Translating term (sizes: 1, 1, 1, 2) ...
% 25.91/25.47  Invoking SAT solver...
% 25.91/25.47  No model exists.
% 25.91/25.47  Translating term (sizes: 3, 1, 1, 1) ...
% 37.61/37.19  Invoking SAT solver...
% 37.61/37.19  No model exists.
% 37.61/37.19  Translating term (sizes: 2, 2, 1, 1) ...
% 49.64/49.18  Invoking SAT solver...
% 49.64/49.18  No model exists.
% 49.64/49.18  Translating term (sizes: 1, 3, 1, 1) ...
% 53.04/52.56  Invoking SAT solver...
% 53.04/52.56  No model exists.
% 53.04/52.56  Translating term (sizes: 2, 1, 2, 1) ...
% 65.19/64.66  Invoking SAT solver...
% 65.19/64.66  No model exists.
% 65.19/64.66  Translating term (sizes: 1, 2, 2, 1) ...
% 68.80/68.30  Invoking SAT solver...
% 68.80/68.31  No model exists.
% 68.80/68.31  Translating term (sizes: 1, 1, 3, 1) ...
% 72.41/71.83  Invoking SAT solver...
% 72.41/71.83  No model exists.
% 72.41/71.83  Translating term (sizes: 2, 1, 1, 2) ...
% 84.36/83.78  Invoking SAT solver...
% 84.36/83.78  No model exists.
% 84.36/83.78  Translating term (sizes: 1, 2, 1, 2) ...
% 87.67/87.08  Invoking SAT solver...
% 87.67/87.08  No model exists.
% 87.67/87.08  Translating term (sizes: 1, 1, 2, 2) ...
% 91.08/90.42  Invoking SAT solver...
% 91.08/90.42  No model exists.
% 91.08/90.42  Translating term (sizes: 1, 1, 1, 3) ...
% 94.18/93.50  Invoking SAT solver...
% 94.18/93.50  No model exists.
% 94.18/93.50  Translating term (sizes: 4, 1, 1, 1) ...
% 127.41/126.70  Invoking SAT solver...
% 127.41/126.70  No model exists.
% 127.41/126.70  Translating term (sizes: 3, 2, 1, 1) ...
% 223.94/222.66  Invoking SAT solver...
% 223.94/222.66  No model exists.
% 223.94/222.66  Translating term (sizes: 2, 3, 1, 1) ...
% 269.69/268.00  Invoking SAT solver...
% 269.69/268.01  No model exists.
% 269.69/268.01  Translating term (sizes: 1, 4, 1, 1) ...
% 273.72/272.03  Invoking SAT solver...
% 273.72/272.06  No model exists.
% 273.72/272.06  Translating term (sizes: 3, 1, 2, 1) ...
% 300.06/298.12  /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 36748 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.06/298.12       36749                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.06/298.13  /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 36643 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.06/298.13       36644 CPU time limit exceeded (core dumped) | grep --line-buffered -v "^###\|^PROOF FAILED for depth\|^Failure node\|inferences so far.  Searching to depth\|^val \|^Loading theory\|^Warning-The type of\|^   monotype.$"
%------------------------------------------------------------------------------